Applications and algorithms for mixed integer nonlinear programming

نویسندگان

  • Sven Leyffer
  • Jeff Linderoth
  • James Luedtke
  • Andrew Miller
  • Todd Munson
چکیده

The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete decision variables model dichotomies, discontinuities, and general logical relationships. Nonlinear functions are required to accurately represent physical properties such as pressure, stress, temperature, and equilibrium. Problems involving both discrete variables and nonlinear constraint functions are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems faced by researchers and practitioners. In this paper, we describe relevant scientific applications that are naturally modeled as MINLPs, we provide an overview of available algorithms and software, and we describe ongoing methodological advances for solving MINLPs. These algorithmic advances are making increasingly larger instances of this important family of problems tractable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient global optimality conditions for general mixed integer nonlinear programming problems

‎In this paper‎, ‎some KKT type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (MINPP) are established‎. ‎We achieve‎ ‎this by employing a Lagrange function for MINPP‎. ‎In addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

متن کامل

A nonlinear multi objective model for the product portfolio optimization: An integer programming

Optimization of the product portfolio has been recognized as a critical problem in industry, management, economy and so on. It aims at the selection of an optimal mix of the products to offer in the target market. As a probability function, reliability is an essential objective of the problem which linear models often fail to evaluate it. Here, we develop a multiobjective integer nonlinear cons...

متن کامل

A mixed integer nonlinear programming model for optimizing a gas pipeline transmission linear network

The technical equipment developed and used in both installation and operation processes in refineries, oil and gas pipelines, and gas booster stations has always been expensive. Hence, managers at different organizational levels are keen to find methods to control and reduce these costs. Generally speaking, the operators in a gas booster station choose the operating devices without considering ...

متن کامل

A New Model for Location-Allocation Problem within Queuing Framework

This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

متن کامل

A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009